JMLR: Workshop and Conference Proceedings vol–3 Open Problem: Fast Stochastic Exp-Concave Optimization Tomer Koren

Source URL: www.jmlr.org

Stochastic Selfish Routing EVDOKIA NIKOLOVA Texas A&M University and NICOLAS STIER-MOSES Columbia University

Source URL: www.sigecom.org

• Game theory
• Price of anarchy
• Nash equilibrium
• Algorithmic game theory
• Shortest path problem
• Congestion game
• Economic equilibrium
• Routing
• Potential game
• Mathematical optimization
• Strategy

UTILITARIAN MECHANISM DESIGN FOR MULTI-OBJECTIVE OPTIMIZATION∗ FABRIZIO GRANDONI† , PIOTR KRYSTA‡ , STEFANO LEONARDI§ , AND CARMINE VENTRE¶ Abstract. In a classic optimization problem the complete input data is a

Source URL: people.idsia.ch

Reformulating Branch Coverage as a Many-Objective Optimization Problem Annibale Panichella∗, Fitsum Meshesha Kifetew†‡ , Paolo Tonella‡ ∗ Delft University of Technology, The Netherlands

Source URL: www.sesa.dmi.unisa.it

Barriers to Near-Optimal Equilibria Tim Roughgarden Computer Science Department Stanford University Stanford, CA, USA Email:

Source URL: theory.stanford.edu

• Game theory
• Price of anarchy
• Approximation algorithm
• Mathematical optimization
• Epsilon-equilibrium
• Congestion game
• Optimization problem
• Computational complexity theory
• Nash equilibrium
• Mechanism design

SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics 

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Complexity classes
• Polynomial-time approximation scheme
• Mechanism design
• Optimization problem
• Approximation algorithm
• Time complexity
• Mathematical optimization
• Exact algorithm
• Single-parameter utility
• Perturbation theory

PDF Document

Source URL: security.cs.georgetown.edu

• Graph theory
• Mathematics
• Computational complexity theory
• Edsger W. Dijkstra
• Combinatorial optimization
• Network theory
• Maximal independent set
• Graph coloring
• Shortest path problem
• Matching
• Leader election
• Minimum spanning tree

Introduction and the Minimum Vertex Cover Problem Introduction This course deals with designing and analyzing algorithms for various computational problems. Such problems have several forms: Optimization problems, Searc

Source URL: www.eng.tau.ac.il

A CASE STUDY: Halliburton integration solves problem and saves money for customer. Halliburton provides optimization of stimulation fluids in real time using distributed temperature sensing with coiled tubing. OV E RV I

Source URL: www.halliburton.com

Discussion Paper NoENDOGENOUS INFORMATION ACQUISITION AND THE PARTIAL ANNOUNCEMENT POLICY Hiroki Arato

Source URL: www.iser.osaka-u.ac.jp

• Economic model
• Mathematical optimization
• Problem solving
• Game theory
• Welfare economics
• Bayesian game